Capacity and decoding rules for classes of arbitrarily varying channels
نویسندگان
چکیده
Ahstrucf -We consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error critenon and, typically, subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former the capacity is explicitly determined and shown to be attainable by minimum distance decoding. Next, for a large class of additive AVC‘s, in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, we prove that capacity can be attained by a universal decoding rule. Finally, the effect of random state selection on capacity is studied, enabling us to comment on the merits and limitations of a previous “mutual information game” approach.
منابع مشابه
Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources
Communication over channels that may vary in an arbitrary and unknown manner from channel use to channel use is studied. Such channels fall in the framework of arbitrarily varying channels (AVCs), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. However, more sophisticated strategies such as common r...
متن کاملCapacity results for classes of wiretap channels
We consider two communication systems which are time-discrete and memoryless, both depend on a state, in terms of information-theoretic secure data transmission. The compound channel consists of a finite or infinite set of channels which is known to both the sender and the receiver, but unfortunately it is not known which channel is in use for any codeword transmission. In contrast the state of...
متن کاملChannels with Arbitrarily Varying Channel Probability Functions in the Presence of Noiseless Feedback
In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a. v. ch. f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding...
متن کاملState constraints and list decoding for the AVC
List decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within ǫ of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list decoding using lists of size O(1/ǫ). Under average error an achievable rate region and converse bound are given for lists of size L. These bounds are based...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 1989